Generation of robotic assembly sequences using a simulated annealing
نویسندگان
چکیده
An assembly sequence is considered to be optimal when it minimizes assembly cost while satisfying assembly constraints. The assembly cost relates to assembly operations, assembly motions, and assembly direction changes. This study proposes a simulated-annealing method for the generation of such assembly sequences in robotic assembly. This method reflects the assembly cost to an energy function associated with the assembly sequence. The energy function is iteratively minimized and occasionally perturbed by a simulated annealing until no further change in the energy occurs. As a result, an assembly sequence with a low assembly cost is finally found. To show the effectiveness of the proposed method, case study is presented for an electrical relay. The performance is evaluated from the comparison of the result with the ones obtained from an expert system and a neural network-based approach, previously presented methods.
منابع مشابه
Clustering of Short Read Sequences for de novo Transcriptome Assembly
Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملTwo-machine robotic cell considering different loading and unloading times
In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...
متن کاملDetermination of Material Flows in a Multi-echelon Assembly Supply Chain
This study aims to minimize the total cost of a four-echelon supply chain including suppliers, an assembler, distributers, and retailers. The total cost consists of purchasing raw materials from the suppliers by the assembler, assembling the final product, materials transportation from the suppliers to the assembler, product transportation from the assembler to the distributors, product transpo...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999